The modified objective-constraint scalarization approach for multiobjective optimization problems

نویسندگان

چکیده

In this article, a novel scalarization methodology, called the modified objective-constraint technique, is proposed for determining efficient solutions given multiobjective programming problem. The suggested scalarized problem extends some existing problems. It shown that how adding slack variables to constraints, can help us find easily checked conditions concerning (weak, proper) Pareto optimality. By applying problem, we generate an almost even approximation of front. performance and capability developed approach are demonstrated in test problems containing disconnected or nonconvex fronts feasible points. particular, apply engineering design with two objective functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Implementation of Desirability Function-Based Scalarization Approach for Multiobjective Optimization Problems

Scalarization approaches are the simplest methods for solving the multiobjective problems. The idea of scalarization is based on decomposition of multiobjective problems into single objective sub-problems. Every one of these sub-problems can be solved in a parallel manner since they are independent with each other. Hence, as a scalarization approach, systematically modification on the desirabil...

متن کامل

Adaptive Scalarization Methods in Multiobjective Optimization

Only for you today! Discover your favourite adaptive scalarization methods in multiobjective optimization book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book stores to buy a book. Here, varieties of book collections are available to download. One of them is this adaptive scalarization methods in multiobjective optimization ...

متن کامل

An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization

We apply a flexible Inexact-Restoration (IR) algorithm to optimization problems with multiobjective constraints under the weighted-sum scalarization approach. In IR methods each iteration has two phases. In the first phase one aims to improve the feasibility and, in the second phase, one minimizes a suitable objective function. We show that with the IR framework there is a natural way to explor...

متن کامل

An Adaptive Scalarization Method in Multiobjective Optimization

This paper presents a new method for the numerical solution of nonlinear multiobjective optimization problems with an arbitrary partial ordering in the objective space induced by a closed pointed convex cone. This algorithm is based on the well-known scalarization approach by Pascoletti and Serafini and adaptively controls the scalarization parameters using new sensitivity results. The computed...

متن کامل

Constraint Approach to Multi-Objective Optimization

In many practical situations, we would like to maximize (or minimize) several different criteria, and it is not clear how much weight to assign to each of these criteria. Such situations are ubiquitous and thus, it is important to be able to solve the corresponding multi-objective optimization problems. There exist many heuristic methods for solving such problems. In this paper, we reformulate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hacettepe journal of mathematics and statistics

سال: 2022

ISSN: ['1303-5010']

DOI: https://doi.org/10.15672/hujms.930601